Unsymmetric Ordering Using A Constrained Markowitz Scheme
نویسندگان
چکیده
منابع مشابه
Unsymmetric Ordering Using A Constrained Markowitz Scheme
We consider the LU factorization of unsymmetric sparse matrices using a threephase approach (analysis, factorization and triangular solution). Usually the analysis phase first determines a set of potentially good pivot and then orders this set of pivots to decrease the fill-in in the factors. In this paper, we present a preprocessing algorithm that simultaneously achieves the objectives of sele...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملMarkowitz scheme for the sparse WZ factorization
In this paper the authors present problems which can appear when a sparse square matrix (without any special structure) is factorized to a product of matrices W and Z. The fill-in problem is considered, and the manners of its solving – by permuting both rows and columns with a modified Markowitz scheme among others. The results of numerical experiments for sparse matrices of various sizes are p...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملDiagonal Markowitz Scheme with Local Symmetrization
We describe a fill-reducing ordering algorithm for sparse, nonsymmetric LU factorizations, where the pivots are restricted to the diagonal and are selected greedily. The ordering algorithm uses only the structural information. Most of the existing methods are based on some type of symmetrization of the original matrix. Our algorithm exploits the nonsymmetric structure of the given matrix as muc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2007
ISSN: 0895-4798,1095-7162
DOI: 10.1137/050622547